Mathematical Programs with Complementarity Constraints in Function Space: C- and Strong Stationarity and a Path-Following Algorithm
نویسندگان
چکیده
An optimal control problem governed by an elliptic variational inequality is studied. The feasible set of the problem is relaxed and a pathfollowing type method is used to regularize the constraint on the state variable. First order optimality conditions for the relaxed-regularized subproblems are derived and convergence of stationary points with respect to the relaxation and regularization parameters is shown. In particular, Cand strong stationarity as well as variants thereof are studied. The subproblems are solved by using semismooth Newton methods. The overall algorithmic concept is provided and its performance is discussed by means of examples, including problems with bilateral constraints and a nonsymmetric operator.
منابع مشابه
An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
Interior point methods for nonlinear programs (NLP) are adapted for solution of mathematical programs with complementarity constraints (MPCCs). The constraints of the MPCC are suitably relaxed so as to guarantee a strictly feasible interior for the inequality constraints. The standard primal-dual algorithm has been adapted with a modified step calculation. The algorithm is shown to be superline...
متن کاملSolving Mathematical Programs with Equilibrium Constraints
This paper aims at developing effective numerical methods for solving mathematical programs with equilibrium constraints. Due to the existence of complementarity constraints, the usual constraint qualifications do not hold at any feasible point, and there are various stationarity concepts such as Clarke, Mordukhovich, and strong stationarities that are specially defined for mathematical program...
متن کاملGeneralized stationary points and an interior-point method for mathematical programs with equilibrium constraints
Generalized stationary points of the mathematical program with equilibrium constraints (MPEC) are studied to better describe the limit points produced by interior point methods for MPEC. A primal-dual interior-point method is then proposed, which solves a sequence of relaxed barrier problems derived from MPEC. Global convergence results are deduced without assuming strict complementarity or the...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملA Modified Relaxation Scheme for Mathematical Programs with Complementarity Constraints: Erratum
In [1], a modified relaxation method was proposed for mathematical programs with complementarity constraints and some new sufficient conditions for Mor B-stationarity were shown. However, due to an ignored sign in the Lagrangian function of the relaxed problem, the proofs of Theorems 3.4 and 3.5 in [1] are incorrect. In what follows, we give the corrected proofs. Throughout, we use the same not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Journal on Optimization
دوره 20 شماره
صفحات -
تاریخ انتشار 2009